package mao.leetcode.string.leetcode227;

import java.util.Stack;

public class Solution {

    public int calculate(String s) {
        if (s.trim().equals("")) return 0;
        Stack<Character> operater = new Stack<>();
        Stack<Integer> operand = new Stack<>();
        int index=0;
        while (index < s.length()){
            char c = s.charAt(index);
            if (c == '+'||c == '-'){
                while ( ! operater.isEmpty()){
                    Character pop = operater.pop();
                    Integer operand_1 = operand.pop();
                    Integer operand_2 = operand.pop();
                    switch (pop){
                        case '+':;
                    }

                }
            }
        }
        return 0;

    }
}
